Exploiting Obstacle Geometry to Reduce Search Time in Grid-Based Pathfinding
نویسندگان
چکیده
منابع مشابه
Backward Real Time Heuristic Search in Grid World Pathfinding
The A* algorithm works well for problems where the solution can be computed offline. In the real time search paradigm, an algorithm must compute the solution online: computation time is not free. Real time heuristic search is search in which the goal is to calculate a plan as close to an optimal plan as possible with the constraint that the algorithm executes an action after each tick of comput...
متن کاملVideo Game Pathfinding and Improvements to Discrete Search on Grid-based Maps
The most basic requirement for any computer controlled game agent in a video game is to be able to successfully navigate the game environment. Pathfinding is an essential component of any agent navigation system. Pathfinding is, at the simplest level, a search technique for finding a route between two points in an environment. The real-time multi-agent nature of video games places extremely tig...
متن کاملReal-time Heuristic Search for Pathfinding in Video Games
Game pathfinding is a challenging problem due to a limited amount of per-frame CPU time commonly shared among many simultaneously pathfinding agents. The challenge is rising with each new generation of games due to progressively larger and more complex environments and larger numbers of agents pathfinding in them. Algorithms based on A* tend to scale poorly as they must compute a complete, poss...
متن کاملExploiting Stability to Reduce Time-Space Cost for Memory Tracing
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete address traces are timeconsuming to acquire and too large to practically store except in the case of short-running programs. Also, memory traces have to be re-acquired each time the input data (and thus the dynamic b...
متن کاملExploiting Term Hiding to Reduce Run-Time Checking Overhead
One of the most attractive features of untyped languages is the flexibility in term creation and manipulation. However, with such power comes the responsibility of ensuring the correctness of these operations. A solution is adding run-time checks to the program via assertions, but this can introduce overheads that are in many cases impractical. While static analysis can greatly reduce such over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12071186